A simple local 3-approximation algorithm for vertex cover
نویسندگان
چکیده
منابع مشابه
A simple local 3-approximation algorithm for vertex cover
Given a graph G = (V , E), a subset of nodes C ⊆ V is a vertex cover if each edge {u, v} ∈ E has u ∈ C or v ∈ C . In this work, we present a constant-time distributed algorithm for finding a factor 3 approximation for minimum vertex cover in bounded-degree graphs. A distributed algorithm that runs in constant time (constant number of synchronous communication rounds) is called a local algorithm...
متن کاملA Local 2-Approximation Algorithm for the Vertex Cover Problem
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆+ 1) synchronous communication rounds, where ∆ is the maximum degree of the graph. For ∆ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.
متن کاملA Near Optimal Approximation Algorithm for Vertex-Cover Problem
Recently, there has been increasing interest and progress in improvising the approximation algorithm for well-known NP-Complete problems, particularly the approximation algorithm for the Vertex-Cover problem. Here we have proposed a polynomial time efficient algorithm for vertex-cover problem for more approximate to the optimal solution, which lead to the worst time complexity Θ(V ) and space c...
متن کاملAn Improved Approximation Algorithm for Vertex Cover with Hard Capacities
In this paper we study the capacitated vertex cover problem, a generalization of the well-known vertex cover problem. Given a graph G = (V,E), the goal is to cover all the edges by picking a minimum cover using the vertices. When we pick a vertex, we can cover up to a pre-specified number of edges incident on this vertex (its capacity). The problem is clearly NP-hard as it generalizes the well-...
متن کاملApproximation Algorithm for N-distance Minimal Vertex Cover Problem
Evolution of large scale networks demand for efficient way of communication in the networks. One way to propagate information in the network is to find vertex cover. In this paper we describe a variant of vertex cover problem naming it N-distance Vertex Minimal Cover(N-MVC) Problem to optimize information propagation throughout the network. A minimum subset of vertices of a unweighted and undir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2009
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.02.017